An Improved Approach for Spatial Domain Lossless Image Data Compression Method by Reducing Overhead Bits

Lossless image compression techniques are used in digital imaging where large amount of data is to be stored without compromising the image quality. The volume of data that can be compressed using lossless image compression schemes is usually much lesser than that of its lossy compression counterparts. Yet, however, lossless compression algorithms are popular in a number of particular image data storage sectors. To meet the increasing demand of large amount of high quality image data storing, numerous algorithms were developed during last few decades featuring lossless image compression and covering various aspects of data compression approaches. Spatial domain lossless image compression methods are popular in most respects since their computational time is comparatively much lesser. In this paper, we focus on a spatial domain image compression technique that uses simple arithmetic operations in order to achieve the specified goal. We revealed that the mentioned algorithm is not always as advantageous as other spatial domain compression systems and often suffers from overhead transmission of unnecessary image data. The thorough investigation over the technique is reported along with the discovered mathematical bound at which the algorithm of interest is failed to achieve the desired target. Finally, to reduce the overhead obtained as a result of algorithmic trouble, an improved mechanism is suggested so that both the transmission time and storage space requirements using this method is facilitated.